DISK SCHEDULING

Experiment Number 2 : Shortest Seek Time First

Algorithm

• Step 1: Let Request array represent an array storing indexes of tracks that have been requested in ascending order of their time of arrival. ‘Head’ is the position of disk head.

• Step 2: Find the positive distance of all tracks in the request array from head.

• Step 3: Find a track from requested array which has not been accessed/serviced yet and has minimum distance from head.

• Step 4: Increment the total seek count with this distance.

• Step 5: Currently serviced track position now becomes the new head position.

• Step 6: Go to step 2 until all tracks in request array have not been serviced.